Isomorphism criterion for monomial graphs
نویسندگان
چکیده
منابع مشابه
Isomorphism criterion for monomial graphs
Let q be a prime power, Fq be the field of q elements, and k;m be positive integers. A bipartite graph G 1⁄4 Gqðk;mÞ is defined as follows. The vertex set of G is a union of two copies P and L of two-dimensional vector spaces over Fq, with two vertices ðp1;p2Þ 2 P and 1⁄2 l1; l2 2 L being adjacent if and only if p2 þ l2 1⁄4 p 1 l 1 . We prove that graphs Gqðk ;mÞ and Gq0 ðk 0;m0Þ are isomorphic...
متن کاملAn Isomorphism Criterion for Monomial Graphs
Let q be a prime power, Fq be the field of q elements, and k, m be positive integers. A bipartite graph G = Gq(g, h, k,m) is defined as follows. The vertex set of G is a union of two copies P and L of two-dimensional vector spaces over Fq, with two vertices (p1, p2) ∈ P and [ l1, l2 ] ∈ L being adjacent if and only if p2 + l2 = p1l 1 . We prove that graphs Gq(k, m) and Gq′(k,m) are isomorphic i...
متن کاملA Note on the Isomorphism Problem for Monomial Digraphs
Let p be a prime e be a positive integer, q = p, and let Fq denote the finite field of q elements. Let m, n, 1 ≤ m, n ≤ q − 1, be integers. The monomial digraph D = D(q; m, n) is defined as follows: the vertex set of D is Fq, and ((x1, x2), (y1, y2)) is an arc in D if x2 + y2 = x1 y 1 . In this note we study the question of isomorphism of monomial digraphs D(q; m1, n1) and D(q; m2, n2). In part...
متن کاملIsomorphism certificates for undirected graphs
For a graph G, we are interested in a minimum-size subgraph of G which, along with an unlabelled copy of G, provides enough information to reconstruct G. We perform a preliminary study of such subgraphs, focusing on the cases where G is a complete tree or a grid. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملIsomorphism testing for circulant graphs
In this paper we focus on connected directed/undirected circulant graphs Cn(a, b). We investigate some topological characteristics, and define a simple combinatorial model, which is new for the topic. Building on such a model, we derive a necessary and sufficient condition to test whether two circulant graphs Cn(a, b) and Cn(a , b) are isomorphic or not. The method is entirely elementary and co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2005
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.20055